The bicube: an interconnection of two hypercubes

نویسندگان

  • Hyeong-Seok Lim
  • Jung-Heum Park
  • Hee-Chul Kim
چکیده

We consider two definitions of the even-dimensional hypercube given in the literature. The labeled graphs obtained by two definitions are not same, but one is isomorphic to the other. By interconnecting two labeled graphs in such a way that each pair of vertices with the same label are joined by an edge, we construct a vertex-symmetric graph with the diameter about half that of a comparable hypercube. We extend the result to a general scheme for interconnecting two hypercubes to produce a network topology called the bicube. We show that the bicube preserves the vertex-symmetry, bipartiteness, hamiltonian and bipancyclic properties of the hypercube, and is highly edge-symmetric.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

خواص متریک و ترکیبیاتی مکعب‌های فیبوناتچی و لوکاس

An n-dimensional hypercube, Q_n, is a graph in which vertices are binary strings of length n where two vertices are adjacent if they differ in exactly one coordinate. Hypercubes and their subgraphs have a lot of applications in different fields of science, specially in computer science. This is the reason why they have been investigated by many authors during the years. Some of their subgraphs ...

متن کامل

Parallel routing in exchanged hypercubes

Parallel routing and diameter are two important issues in interconnection networks. The hypercube is one of the most popular interconnection networks for parallel systems due to its attractive properties such as low diameter and efficient parallel routing. The exchanged hypercube, which is a variant of the hypercube by removing some specific edges, remains several desirable properties of the hy...

متن کامل

On The Rearrangeability Of Hypercubes Networks Characterization Of Some Non-1-Partitionable Permutations On 4D-hypercubes

This paper addresses the problem of the nDhypercubes interconnection networks rearrangeability that is the capability of such networks to route optimally arbitrary permutations under queueless communication constraints. The k-partitioning is an unifying paradigm of such routing. For a permutation which is not constituted of two sub-permutations on two disjoint (n-1)D-hypercubes of the nD-hyperc...

متن کامل

Embedding Variants of Hypercubes with Dilation

Graph embedding has been known as a powerful tool for implementation of parallel algorithms and simulation of interconnection networks. In this paper, we introduce a technique to obtain a lower bound for the dilation of an embedding. Moreover, we give algorithms for embedding variants of hypercubes with dilation 2 proving that the lower bound obtained is sharp. Further, we compute the exact wir...

متن کامل

The Balanced Hypercube: A Cube-Based System for Fault-Tolerant Applications

In this paper, we present an interconnection structure, called the balanced hypercube, which is a variation of the standard hypercube with desirable properties of strong connectivity, regularity, and symmetry. The proposed structure is a special type of load balanced graph designed to tolerate processor failure. In balanced hypercubes, each processor has a backup (matching) processor that share...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Int. J. Comput. Math.

دوره 92  شماره 

صفحات  -

تاریخ انتشار 2015